Adaptive neighborhood search for nurse rostering
نویسندگان
چکیده
This paper presents an adaptive neighborhood search method (ANS) forsolving the nurse rostering problem proposed for the First InternationalNurse Rostering Competition (INRC-2010). ANS uses jointly two distinctneighborhood moves and adaptively switches among three intensificationand diversification search strategies according to the search history. Com-putational results assessed on the three sets of 60 competition instances showthat ANS improves the best known results for 12 instances while matchingthe best bounds for 39 other instances. An analysis of some key elementsof ANS sheds light on the understanding of the behavior of the proposedalgorithm.
منابع مشابه
A Decomposition, Construction and Post- Processing Approach for Nurse Rostering
This paper presents our work on decomposing a specific nurse rostering problem by cyclically assigning blocks of shifts, which are designed considering both hard and soft constraints, to groups of nurses. The rest of the shifts are then assigned to the nurses to construct a schedule based on the one cyclically generated by blocks. The schedules obtained by decomposition and construction can be ...
متن کاملA Hybrid Approach for Solving Real-World Nurse Rostering Problems
Nurse rostering is the process of creating a plan for nurse working hours over a given time horizon. This problem, most variants of which are NP-hard, has been studied extensively for many years. Still, practical nurse rostering is mostly done manually, often by highly qualified health care personnel. This underlines the need to address the challenges of realistic, applied nurse rostering, and ...
متن کاملA greedy-based neighborhood search approach to a nurse rostering problem
A practical nurse rostering problem, which arises at a ward of an Italian hospital, is considered. The nurse rostering problem is a typical employee timetabling problem, where each month it is required to generate the nursing staff shifts subject to various contractual and operational requirements. These requirements may be in conflict especially for those months in which manpower is reduced du...
متن کاملSolving the Nurse Rostering Problem Knowledge Representation and Reasoning Seminar
Nurse rostering is a complex problem which affects the everyday activities and health care tasks in modern hospitals. The Nurse Rostering Problem is a subclass of the personnel scheduling problems, and most of its instances are NP-hard. The goal is to find a quality assignment of shift categories to available nurses. Even though solving the Nurse Rostering Problem has been a field of interest o...
متن کاملLocal Search Neighbourhoods to Deal with a Novel Nurse Rostering Model
A novel nurse rostering model is developed to represent real world problem instances more accurately. The proposed model is generic in a way that different problem instances can be successfully represented. Novel local search neighbourhoods are developed to take advantage of the problem properties represented by the model. These neighbourhoods are utilised within a variable neighbourhood search...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 218 شماره
صفحات -
تاریخ انتشار 2012